Operational and goal-independent denotational semantics for Prolog with cut
نویسندگان
چکیده
منابع مشابه
Operational and Goal-Independent Denotational Semantics for Prolog with Cut
counterparts of the conditions and of the other operators are de ned below: De nition 44 Given ~ s; ~ s1; ~ s2 2 Seq(C A ) we de ne o(~ s) = G o+cb2~ s(o u b /obs) ; (~ s) = G o+db2~ s(o u b /obs) ; (~ s) = G o+!b2~ s(o u b /obs) ; (~ s) = (~ s) t (~ s) ; (~ s1; ~ s2) = G o+cb2~ s1(o u (b (~ s2))) ; (o+c b) ~ s =o (b} ~ s) (o+d b) ~ s =o+d b (o+! b) ~ s =o+! b (~ s1 :: ~ s2) ~ s =(~ s1 ~ s) :: ...
متن کاملOperational and Goal-Independent Denotational Semantics for Prolog with Cut: Proofs
This paper contains the proofs of the results of 1] not already contained there. We refer to 1] for notation. We deene a stronger ordering on trees than. We say that T2 is a blooming of T1, and we write T1 T2, if and only if T2 is obtained with a strict expansion of the divergent leaves of T1. More formally we deene: (G; ") (G; ") if not div(G) (G; ") (G; ~ t) if div(G) The interest in the bloo...
متن کاملDenotational and Operational Semantics for Prolog
The semantics of Prolog programs is usually given in terms of the model theory of first order logic. However, this does not adequately characterize the computational behavior of Prolog programs. Prolog implementations typically use a sequential evaluation strategy based on the textual order of clauses and literals in a program, as well as non-logical features like ‘‘cut’’. In this work we devel...
متن کاملA Denotational Semantics for Prolog
analysis is nite, which was not the case in our previous proposal [13]. The overheadneeded for reaching an improved precision essentially consists in the use of observability andkernel constraints and of their success and failure conditions.We can now consider the already mentioned paper [11]. A big di erence arises lookingfor instance at the way they handle clause composition a...
متن کاملOperational and Denotational Semantics
The types are , ::= Nat ∣ → . All the terms in the language come with explicit types. In particular, we assume an infinite, countable set of variables of each type , and write x for a variable of type . The terms t of type (in short, t : ) are defined by induction on their size by : – every variable x is of type ; – if N : , then x ⋅N is a term of type → ; – if M : → and N : , then MN is a term...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Logic Programming
سال: 2000
ISSN: 0743-1066
DOI: 10.1016/s0743-1066(99)00012-6